#include <iostream>
#include <vector>
#include <string>
using namespace std;
 
int LCS(const string& m, const string& n)
{	// Longest common subsequence
	int n1 = m.size(), n2 = n.size();
	vector<vector<int>> dp(n1 + 1, vector<int>(n2 + 1));
	for (int i = 1; i <= n1; ++i)
	{
		for (int j = 1; j <= n2; ++j)
		{
			if (m[i - 1] == n[j - 1])
				dp[i][j] = dp[i - 1][j - 1] + 1;
			else
				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
		}
	}
	return dp[n1][n2];
}
 
int main()
{
	string m, n;
	while (cin >> m >> n)
	{
		cout << LCS(m, n) << endl;
	}
	return 0;
}